Algorithms for strongly stable ideals
نویسندگان
چکیده
منابع مشابه
Betti numbers of strongly color-stable ideals and squarefree strongly color-stable ideals
In this paper, we will show that the color-squarefree operation does not change the graded Betti numbers of strongly color-stable ideals. In addition, we will give an example of a nonpure balanced complex which shows that colored algebraic shifting, which was introduced by Babson and Novik, does not always preserve the dimension of reduced homology groups of balanced simplicial complexes.
متن کاملStanley Filtrations and Strongly Stable Ideals
We give a new short proof of the fact that the CastelnuovoMumford regularity of a strongly stable ideal is the highest degree of a minimal monomial generator. Our proof depends on results due to D. Maclagan and G. Smith on multigraded regularity. More precisely, we construct a Stanley filtration for strongly stable ideals which provides a bound for the Castelnuovo-Mumford regularity.
متن کاملStrongly stable ideals and Hilbert polynomials
Strongly stable ideals are a key tool in commutative algebra and algebraic geometry. These ideals have nice combinatorial properties that makes them well suited for both theoretical and computational applications. In the case of polynomial rings with coefficients in a field with characteristic zero, the notion of strongly stable ideals coincides with the notion of Borel-fixed ideals. Ideals of ...
متن کاملSequential algorithms and strongly stable functions
Intuitionistic proofs (or PCF programs) may be interpreted as functions between domains, or as strategies on games. The two kinds of interpretation are inherently different: static vs. dynamic, extensional vs. intentional. It is extremely instructive to compare and to connect them. In this article, we investigate the extensional content of the sequential algorithm hierarchy [−]SDS introduced by...
متن کاملProjecting Sequential Algorithms on Strongly Stable Functions
We relate two sequential models of PCF: the sequential algorithm model due to Berry and Curien and the strongly stable model due to Bucciarelli and the author. More precisely, we show that all the morphisms araising in the strongly stable model of PCF are sequential in the sense that they are the \extensional projections" of some sequential algorithms. We deene a model of PCF where morphisms ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2014
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-2014-02784-1